Witten’s conjecture and Property P

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

3 Witten ’ s conjecture and Property P

The purpose of this note is to prove the conjecture. The ingredients of the argument are: (a) Taubes’ theorem [11] on the non-vanishing of the SeibergWitten invariants for symplectic 4-manifolds; (b) the theorem of Gabai [7] on the existence of taut foliations on 3-manifolds with non-zero betti number; (c) the construction of Eliashberg and Thurston [4], which produces a contact structure from ...

متن کامل

$L^p$-Conjecture on Hypergroups

In this paper, we study $L^p$-conjecture on locally compact hypergroups and by some technical proofs we give some sufficient and necessary conditions  for a weighted Lebesgue space  $L^p(K,w)$ to be a convolution Banach algebra, where $1<p<infty$, $K$ is a locally compact hypergroup and $w$ is a weight function on $K$.  Among the other things, we also show that if $K$ is a locally compact hyper...

متن کامل

p-spaces and artin-rees property

in this article, we study the artin-rees property in  c(x), in the  rings of fractions of  c(x) and in the factor rings of c(x) . we show that c(x)/(f) is an artin-rees ring if and only if  z(f)  is an open p-space. a necessary and sufficient condition for the local rings of  c(x)   to be artin-rees rings is that each prime ideal in  c(x)  becomes minimal and it turns out that every local ring ...

متن کامل

Decision P Systems and the P!=NP Conjecture

In this paper we present the model of decision P systems with external output and prove the following main result: if there exists an NP–complete problem that cannot be solved in polynomial time, with regard to the input length, by the deterministic variant of such P systems, constructed in polynomial time, then P 6= NP . From Zandron-FerretiMauri’s theorem it follows that if P 6= NP then no NP...

متن کامل

The 2-Pebbling Property and a Conjecture of Graham's

The pebbling number of a graph G, f(G), is the least m such that, however m pebbles are placed on the vertices of G, we can move a pebble to any vertex by a sequence of moves, each move taking two pebbles o one vertex and placing one on an adjacent vertex. It is conjectured that for all graphs G and H , f(G H) f(G)f(H). Let Cm and Cn be cycles. We prove that f(Cm Cn) f(Cm)f(Cn) for all but a ni...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Geometry & Topology

سال: 2004

ISSN: 1364-0380,1465-3060

DOI: 10.2140/gt.2004.8.295